Quantum Speedup for Index Modulation

نویسندگان

چکیده

This paper presents a quantum-assisted index modulation for next-generation IoT wireless networks. The NP-hard selection problem is first formulated by quadratic unconstrained binary optimization (QUBO) consisting of constraints feasible solutions. To minimize the number qubits required quantum circuit, this formulation then simplified dictionary-based approach that partially exploits classical computer. For both formulations, numbers and non-zero elements in QUBO matrices are analyzed algebraically, found to be close agreement with actual measurement. It observed Grover adaptive search can provide speedup problem. promising result implies on-off structure suitable computation, future fault-tolerant computers may useful obtaining high-performance activation patterns.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum speedup by quantum annealing.

We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involve...

متن کامل

Quantum speedup in stoquastic adiabatic quantum computation

Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation have been investigated to show quantum computational supremacy. At a commercial side, quantum annealing machine realizes the quantum Ising model with a transver...

متن کامل

Defining and detecting quantum speedup

Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer∗1 Theoretische Physik, ETH Zurich, 8093 Zurich, Switzerland Department of Chemistry and Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, California 90089, USA Department of Physics and Center for Quant...

متن کامل

Measures of Quantum Computing Speedup

SFI Working Papers contain accounts of scienti5ic work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-­‐reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited v...

متن کامل

Speedup in Quantum Adiabatic Evolution Algorithm

Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential to examine the minimum energy gap between the ground level and the next one through the evolution. In this letter, we show a way of speedup in quantum adiaba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3103207